An Agent Based Approach to Patient Scheduling Using Experience Based Learning

نویسندگان

  • E. Grace Mary Kanaga
  • M. L. Valarmathi
  • Juliet A. Murali
چکیده

This paper describes an agent based approach to patient scheduling using experience based learning and an integer programming model. The evaluation on different learning techniques shows that the experience based learning (EBL) provides a better solution. The time required to process a particular job is reduced as the experience processed by it increases. The processing time can be calculated with the help of EBL. The main objective of this patient scheduling system is to reduce the waiting time of patient in hospitals and to complete their treatment in minimum required time. The proposed framework is implemented in JADE. In this approach the patients are represented as patient agent (PA) and resources as resource agent (RA). This mathematical model provides an optimal solution. The comparisons of the proposed framework with other scheduling rules shows that an agent based approach to patient scheduling using EBL gives better results. learning technique would be a good choice (Kanaga, Valarmathi, & Murali, in press). Here we consider each patient and resources as agents and they interact with each other (Janiak & Rudek, 2005). The agent based approach considers the patients as Patient Agents (PA) and resources as Resource Agents (RA). The PA requests for the resource. A special agent named Common Agent (CA) is also introduced in this framework. CA refers to a general physician who decides on what tasks the patient has to undergo. The proposed framework is trying to reduce the DOI: 10.4018/jats.2010100101 2 International Journal of Agent Technologies and Systems, 2(4), 1-9, October-December 2010 Copyright © 2010, IGI Global. Copying or distributing in print or electronic forms without written permission of IGI Global is prohibited. patients waiting time and tardiness. We can further reduce this by incorporating experience based learning. The learning models in scheduling are based on the learning curve introduced by Wright (Janiak, Janiak, Rudek, & Wielgus, 2009). In scheduling problems with a new experience-based learning model, job processing times are described by “S”-shaped functions that are dependent on the experience of the processor. In patient scheduling, decisions are made according to the learning model (Becker, Navarro, Krempels & Panchenko, 2003).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method

In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...

متن کامل

An Unsupervised Learning Method for an Attacker Agent in Robot Soccer Competitions Based on the Kohonen Neural Network

RoboCup competition as a great test-bed, has turned to a worldwide popular domains in recent years. The main object of such competitions is to deal with complex behavior of systems whichconsist of multiple autonomous agents. The rich experience of human soccer player can be used as a valuable reference for a robot soccer player. However, because of the differences between real and simulated soc...

متن کامل

Dynamic configuration and collaborative scheduling in supply chains based on scalable multi-agent architecture

Due to diversified and frequently changing demands from customers, technological advances and global competition, manufacturers rely on collaboration with their business partners to share costs, risks and expertise. How to take advantage of advancement of technologies to effectively support operations and create competitive advantage is critical for manufacturers to survive. To respond to these...

متن کامل

Learning Curve Consideration in Makespan Computation Using Artificial Neural Network Approach

This paper presents an alternative method using artificial neural network (ANN) to develop a scheduling scheme which is used to determine the makespan or cycle time of a group of jobs going through a series of stages or workstations. The common conventional method uses mathematical programming techniques and presented in Gantt charts forms. The contribution of this paper is in three fold. First...

متن کامل

A multi Agent System Based on Modified Shifting Bottleneck and Search Techniques for Job Shop Scheduling Problems

This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJATS

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2010